// -*- coding: utf-8 -*- 
/**
 * Project: AlgorithmsLearn
 *
 * @author: yanking
 * Create time: 2022-03-12 21:04
 * IDE: IntelliJ IDEA
 * Introduction:
 */
package com.LeetCodeT.DynamicPlan;

import java.util.HashMap;
import java.util.List;

public class WordBreak {
    public boolean I(String s, List<String> wordDict) {
        // 朴素遍历 + 判断
        HashMap<Character, List<String>> words = new HashMap<>();
        for (String s1 : wordDict) {
            char c = s1.charAt(0);
            words.put(c, wordDict);
        }

        return false;
    }
}
